Solving the Routing Problems in Delay Tolerant Networks by HTC

doi:10.13190/jbupt.201005.28.liuql

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2010, Vol. 33 ›› Issue (5): 28-32.doi: 10.13190/jbupt.201005.28.liuql

• Papers • Previous Articles Next Articles

Solving the Routing Problems in Delay Tolerant Networks by HTC

Received:2009-10-21 Revised:2010-04-01 Online:2010-08-28 Published:2010-06-15

Abstract

Abstract:

The traditional shortest path algorithm is not suitable for the routing choice in delay tolerant networks (DTN). According to the routing features in DTN，a new shortest path algorithm hopbased, timevarying cost (HTC) is proposed based on the hop and the cost varied with the time. The design of the routing algorithm not only considers the space factor between the nodes in DTN, but also the time factor of the wireless links and the complexity and accuracy. Simulation compared with the existing routing algorithm such as first contact (FC), minimum expected delay (MED), indicate that the algorithm proposed by this paper is more effective to get the shortest path.

Key words: delay tolerant network, routing, Floyd, hopbased timevarying cost

References

[1] Juang P, Oki H, Martonosi M, et al. Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with zebranet//ASPLOS02. San Jose: ACM Press, 2002: 96-107.
[2] The project of ZebranNet wildlife tracker. (2002-12-05). http://www. ee. princeton. edu/~mrm/zebranet. html.
[3] Burleigh S, Hooke A, Torgerson L, et al. Delay- tolerant networking: an approach to interplanetary Internet[J]. Communications Magazine, 2003, 41(6): 128-136.
[4] Warthman F. Delay tolerant networks (DTNs): a tutorial. (2003-03-05). http://www. ipnsig. org/reports/DTN_Tutorial11.pdf.
[5] Vahdat A, Becker D. Epidemic routing for partially connected ad hoc networks. Durham: Duke University, 2000.
[6] Jain S, Fall K, Patra R. Routing in a delay tolerant network//ACM SIGCOMM 2004. : ACM Press, 2004: 145-158.
[7] Chen Dazong, Kung H, Blah D. Ad hoc relay wireless networks over moving vehicles on highways//ACM Mobihoc 2001. Long Beach: , 2001: 247-250.
[8] Dolev S, Gilbert S, Lynch N A, et al. Virtual mobile nodes for mobile ad hoc networks//DISC 2004. Amsterdam: , 2004: 230-244.
[9] Zhao Wenrui, Ammar M, Zegura E. A message ferrying approach for data delivery in sparse mobile ad hoc networks//ACM Mobihoc 2004. : ACM Press, 2004: 187-198.
[10] Chatzigiannakis I, Nikoletseas S E, Spriakis P G. Analysis and experimental evaluation of an innovative and efficient routing protocol for ad-hoc mobile networks[J]. Lecture Notes in Computer Science, 2001, 1982: 99-110.
[11] 樊秀梅, 李杨. 容迟／容断网络路由技术研究[J]. 中兴通讯技术, 2009, 15(6): 37-40. Fan Xiumei, Li Yang. Routing technology for delay/disruption tolerant networks[J]. ZTE Communications, 2009, 15(6): 37-40.
[12] 米涅卡. 网络和图的最优化算法[M]. 李家滢, 赵关旗, 译. 北京: 中国铁道出版社, 1984: 47-53.
[13] 李云, 王晓英, 刘占军, 等. DTN中链路中断特性的分析[J]. 通信学报, 2008, 29(11): 232-235. Li Yun, Wang Xiaoying, Liu Zhanjun, et al. Analysis of link interruption characteristics in the DTN[J]. Journal on Communications, 2008, 29(11): 232-235.

[1]	. SDN-based integrated convergent network routing scheduling mechanism [J]. Journal of Beijing University of Posts and Telecommunications, 2022, 45(4): 98-104.
[2]	LI Jingbo, MA Li, MA Dongchao, FU Yingxun, LI Yang. SDN-Based Integrated Convergent Network Routing Scheduling Mechanism [J]. Journal of Beijing University of Posts and Telecommunications, 2022, 45(4): 84-90.
[3]	YANG Can, LUO Tao, LIU Ying, LI Zexu, XU Yongqing. QoS Routing Algorithm in Clustered Self-Organizing Networks [J]. Journal of Beijing University of Posts and Telecommunications, 2022, 45(1): 1-6.
[4]	CHEN Wei-xing, SU Jing-fang, ZHAO Hui. Opportunistic Transmission Control Method for Apron Sensing Network Based on Game Theory [J]. Journal of Beijing University of Posts and Telecommunications, 2020, 43(5): 57-63.
[5]	WEN Wei. Routing Algorithm Based on Density Clustering for Delay Tolerant Network [J]. Journal of Beijing University of Posts and Telecommunications, 2020, 43(5): 137-142.
[6]	WANG Yu, ZHANG Lian-cheng, ZHANG Hong-tao, GUO Yi. A Failure Recovery Algorithm for Inter-Domain Routing System Based on Degree-Constrained Minimum Spanning Tree [J]. Journal of Beijing University of Posts and Telecommunications, 2020, 43(4): 113-119.
[7]	KONG Ji-li, CHEN Can. Research Review of Green Vehicle Routing Problem [J]. Journal of Beijing University of Posts and Telecommunications, 2020, 43(3): 77-82.
[8]	XU Meng-meng, ZHU Hai, CUI Ya-jie, XU Heng-zhou. Energy-Efficient Routing with Delay Soft-Constraint in Sparse Mobile Networks [J]. Journal of Beijing University of Posts and Telecommunications, 2020, 43(3): 72-76.
[9]	WANG Cheng, XU Pin, ZHANG Su-bing, WANG Li-quan, WANG Wei-dong. Research and Implementation of Dynamic Routing Protocol for LEO Satellites Based on Linux System [J]. Journal of Beijing University of Posts and Telecommunications, 2020, 43(2): 94-102.
[10]	LIU Bao-ju, YU Peng, FENG Lei, QIU Xue-song, JIANG Hao. Rerouting Algorithm for Load Balancing in SDN-Enabled Smart Grid Communication Network [J]. Journal of Beijing University of Posts and Telecommunications, 2020, 43(2): 16-22.
[11]	MA Qing-liu, YU Peng, WU Jia-hui, XIONG Ao, YAN Yong. A Integrated Energy Service Channel Optimization Mechanism Based on Deep Reinforcement Learning [J]. Journal of Beijing University of Posts and Telecommunications, 2020, 43(2): 87-93.
[12]	YAO Zan, WANG Ying, QIU Xue-song, WEN Yu-qi. Deadline-Aware and Energy Efficient Routing Optimization Algorithm in SD-DCN [J]. Journal of Beijing University of Posts and Telecommunications, 2020, 43(2): 46-51.
[13]	WANG Xuan, HOU Rong-hui, XU Wei-lin. Dynamic Path Switching Technology for LEO Satellite Networks [J]. Journal of Beijing University of Posts and Telecommunications, 2020, 43(2): 80-86,109.
[14]	DU Cong, ZHANG Zhe, LI Wen-jing, GUO Shao-yong, MENG Luo-ming. Trusted Routing and Forwarding Mechanism Based on Dirichlet Distribution [J]. Journal of Beijing University of Posts and Telecommunications, 2020, 43(1): 74-79.
[15]	PAN Lei-na, TAO Yang, XU Xiang-yang, WANG Jin. A Secure Clustering Routing Protocol Based on Trust and Balancing Energy Consumption [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2019, 42(3): 29-36.

Solving the Routing Problems in Delay Tolerant Networks by HTC

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics

Comments